PT-Scotch: A tool for efficient parallel graph ordering

PT-Scotch: A tool for efficient parallel graph ordering

The parallel ordering of large graphs is a difficult problem, because neither minimumdegree algorithms, nor the best graph partitioning methods that are necessary to nested dissection, parallelize or scale well. This paper presents a set of algorithms, implemented in the PT-Scotch software package, which allows one to order large graphs in parallel, yielding orderings the quality of which is eq...

Native mesh ordering with Scotch 4.0

Sparse matrix reordering is a key issue for the the efficient factorization of sparse symmetric matrices, not only to reduce fill-in and operation count, but also to increase concurrency in the elimination tree, which is essential to achieve high speed-ups when solving the systems on parallel architectures. Most sparse matrix reordering software, when applied to finite-element or finite-volume ...

An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph

We design the rst eecient parallel algorithm for computing the minimal elimination ordering (MEO) of an arbitrary graph. The algorithm works in O(log 3 n) parallel time and O(nm) processors on a CREW PRAM, for an n-vertex, m-edge graph, and is optimal up to a polylogarithmic factor with respect to the best sequential algorithm of Rose, Tarjan and Lueker ((RTL 76]). The MEO problem for arbitrary...

Parallel Graph Transformation Applied to AGG Tool

Graph transformation is one of the key concepts in graph grammar. In order to accelerate the graph transformation, the concept of parallel graph transformation has been proposed by different tools such as AGG tool. The theory of parallel graph transformation used by AGG just allows clarifying the concepts of conflict and dependency between the transformation rules. This work proposes an approac...

Parallel Graph Partitioning and Sparse Matrix Ordering Library